Four Players Semantics
for a Family of Paraconsistent and Paracomplete Logics, by Arthur Buchsbaum, Tarcisio Pequeno and
Marcelino Pequeno
XIII Brazilian Logic Conference, 2003, Campinas,
São Paulo, Brazil.
Abstract: A class of two players semantics demonstrate that the
basic logical connectives concerning to negation, implication, conjunction
and disjunction share a same nature in all logics of the presented family,
including classical logic. Such semantics can be extended to corresponding
four players semantics, in which the nature of implication can be shown
in a more precise way.
Reasoning with Plausible
Scenarios, by Arthur Buchsbaum, Tarcisio Pequeno and
Marcelino Pequeno
III World Congress on Paraconsistency, 2003,
Toulouse, France.
IRIT (Institut de Recherche en Informatique de Toulouse), v. 1. pp. 21-21
Abstract: A deviant logic, paraconsistent and paracomplete, named
logic of plausible deduction, is presented. It describes properties of weak
and strong plausibility, and compares the corresponding modalities with
possibility and necessity. This logic is a suitable monotonic basis for
a nonmonotonic logic, adequate for representing several forms of complex
reasoning, including scientific method.
Reasoning within Scientific Theories: A
Logic, by Arthur Buchsbaum and Tarcisio Pequeno
Second Principia International Symposium –
Abstracts, 2001, Núcleo de Epistemologia e Lógica, Federal University
of Santa Catarina, Florianópolis, Brazil, pp. 7-8.
Internet: http://www.cfh.ufsc.br/~nel/resumo.htm.
The Logic of Ambiguous Reference, by Arthur Buchsbaum
11th International Congress of Logic, Methodology
and Philosophy of Science, Volume of Abstracts, International Union of History
and Philosophy of Science, 1999, Krakow, Poland, p. 98.
On Plausible Reasoning and Its Import in
Reasoning about Science, by Arthur Buchsbaum and Tarcisio Pequeno
11th International Congress of Logic, Methodology
and Philosophy of Science, Volume of Abstracts, International Union of History
and Philosophy of Science, 1999, Krakow, Poland, p. 222.
Uma Classe de Lógicas Polissortidas e Seu
Correspondente Teorema de Completude, by Arthur Buchsbaum and Tarcisio Pequeno
XII Encontro Brasileiro de Lógica, 1999,
Parque Nacional de Itatiaia, Rio de Janeiro, Brazil, p. 59.
Abstract: Alternative many-sorted logics, suitable for
representing certain modal logics unless translation, together with a general
proof of their semantical completeness.
A New Group of Logics Featuring Non Classical
Negations, by Arthur Buchsbaum and Tarcisio Pequeno
Stanislaw Jaskowski Memorial Symposium, Parainconsistent
Logic, Logical Philosophy, Mathematics and Informatics, 1998, Torun, Poland,
pp. 53-54.
Abstract: Paraconsistent and/or paracomplete logics,
preserving all characteristics of classical logic which don’t violate
deviant qualities of negation of each one of them.
Ten Paraconsistent and/or Paracomplete Logics
with Recursive Semantics, by Arthur Buchsbaum and Tarcisio Pequeno
Proceedings of 9th International Congress on
Philosophy, Logic and Theory of Sciences, v. 1, Sector of Logic and Computer
Science, 1991, p. 155.
Abstract: A new generation of paraconsistent and/or paracomplete
logics, descending from some logics of the same kind defined by Newton C.
A. da Costa, with recursive semantics.
The Epistemic Inconsistency and Its Logic, by Arthur Buchsbaum and Tarcisio Pequeno
Proceedings of 9th International Congress on
Philosophy, Logic and Theory of Sciences, v. 1, Sector of Philosophical Logic,
1991, p. 108.
Abstract: Basic motivations for a logic formalizing credulous
plausibility.
Four Players Semantics
for a Family of Paraconsistent and Paracomplete Logics, de Arthur Buchsbaum, Tarcisio Pequeno e
Marcelino Pequeno
Resumo – XIII Encontro Brasileiro de Lógica,
Campinas, SP.
Universidade Estadual de Campinas, 2003. v. 1. p. 53-54.
Resumo: Uma classe de semânticas de dois jogadores demonstra
que os conectivos lógicos concernentes à negação,
implicação, conjunção e disjunção
compartilham a mesma natureza em todas as lógicas da família
apresentada, incluindo a própria lógica clássica. Tais
semânticas podem ser estendidas para semânticas correspondentes
de quatro jogadores, nas quais a natureza da implicação pode
ser ilustrada de uma forma mais precisa.
Reasoning with Plausible
Scenarios, de Arthur Buchsbaum, Tarcisio Pequeno e
Marcelino Pequeno
Resumo – III World Congress on Paraconsistency,
2003, Toulouse, França.
IRIT (Institut de Recherche en Informatique de Toulouse), 2003. v. 1. p.
21-21
Resumo: Uma lógica deviante, paraconsistente e paracompleta,
dita a lógica da dedução plausível, é
apresentada, a qual descreve as propriedades da plausibilidade forte e fraca,
e compara as modalidades correspondentes com a necessidade e possibilidade
modais. Tal lógica é uma base monotônica adequada para
uma lógica não monotônica, apta para representar várias
formas de raciocínio complexo, incluindo o método científico.
Reasoning within Scientific Theories: A
Logic, de Arthur Buchsbaum e Tarcisio Pequeno
Resumo – Second Principia International Symposium,
Florianópolis, SC, 2001
Núcleo de Epistemologia e Lógica, Universidade Federal de Santa
Catarina, Florianópolis, Santa Catarina, pgs. 7-8.
Internet: http://www.cfh.ufsc.br/~nel/resumo.htm.
The Logic of Ambiguous Reference, de Arthur Buchsbaum
Resumo – 11th International Congress of Logic,
Methodology and Philosophy of Science, Volume of Abstracts, International
Union of History and Philosophy of Science, 1999, Cracóvia, Polônia,
pg. 98.
Resumo: Um novo qualificador, apto a lidar com a ambigüidade
do discurso matemático e linguístico. São apresentados uma semântica, um
cálculo de seqüentes e alguns resultados elementares.
On Plausible Reasoning and Its Import in
Reasoning about Science, de Arthur Buchsbaum e Tarcisio Pequeno Resumo – 11th International Congress of Logic,
Methodology and Philosophy of Science, Volume of Abstracts
International Union of History and Philosophy of Science, 1999, Cracóvia,
Polônia, pg. 222.
Resumo: Uma representação lógica para a plausibilidade,
destinada à formalização do raciocínio indutivo presente na atividade científica.
Uma Classe de Lógicas Polissortidas e Seu
Correspondente Teorema de Completude, de Arthur Buchsbaum e Tarcisio Pequeno
Resumo - XII Encontro Brasileiro de Lógica,
1999, Parque Nacional de Itatiaia, Rio de Janeiro, pg. 59.
Resumo: Lógicas polissortidas alternativas, aptas
para representar certas lógicas modais a menos de tradução,
são apresentadas, bem como um método genérico de prova
de completude semântica para as mesmas.
A New Group of Logics Featuring Non Classical
Negations, de Arthur Buchsbaum e Tarcisio Pequeno
Stanislaw Jaskowski Memorial Symposium, Parainconsistent
Logic, Logical Philosophy, Mathematics and Informatics, 1998, Torun, Polônia,
pgs. 53-54.
Resumo: Lógicas paraconsistentes e/ou paracompletas
preservando todas as características da lógica clássica
que não violem as qualidades deviantes da negação pretendidas
por cada uma delas.
Ten Paraconsistent and/or Paracomplete Logics
with Recursive Semantics, de Arthur Buchsbaum e Tarcisio Pequeno
Proceedings of 9th International Congress on
Philosophy, Logic and Theory of Sciences, v. 1, Sector of Logic and Computer
Science, 1991, pg. 155.
Resumo: Uma nova geração de lógicas
paraconsistentes e/ou paracompletas, descendentes de algumas das lógicas
da mesma espécie elaboradas por Newton C. A. da Costa, dotadas de
semânticas recursivas.
The Epistemic Inconsistency and Its Logic, de Arthur Buchsbaum e Tarcisio Pequeno
Proceedings of 9th International Congress on
Philosophy, Logic and Theory of Sciences, v. 1, Sector of Philosophical Logic,
1991, pg. 108.
Resumo: Motivações básicas para
uma lógica formalizando a plausibilidade crédula.
Download (18 Kbytes)